Goto

Collaborating Authors

 population map


Fine-grained Population Mapping from Coarse Census Counts and Open Geodata

Metzger, Nando, Vargas-Muñoz, John E., Daudt, Rodrigo C., Kellenberger, Benjamin, Whelan, Thao Ton-That, Ofli, Ferda, Imran, Muhammad, Schindler, Konrad, Tuia, Devis

arXiv.org Artificial Intelligence

Fine-grained population maps are needed in several domains, like urban planning, environmental monitoring, public health, and humanitarian operations. Unfortunately, in many countries only aggregate census counts over large spatial units are collected, moreover, these are not always up-to-date. We present POMELO, a deep learning model that employs coarse census counts and open geodata to estimate fine-grained population maps with 100m ground sampling distance. Moreover, the model can also estimate population numbers when no census counts at all are available, by generalizing across countries. In a series of experiments for several countries in sub-Saharan Africa, the maps produced with POMELOare in good agreement with the most detailed available reference counts: disaggregation of coarse census counts reaches R2 values of 85-89%; unconstrained prediction in the absence of any counts reaches 48-69%.


This is how the world looks on Facebook's population maps

Engadget

Facebook's Connectivity Lab today released its high-resolution population maps for Malawi, South Africa, Ghana, Haiti and Sri Lanka, with the promise to make more datasets available over the coming months. The population maps are a joint effort between the Facebook Connectivity Lab, Columbia University and the World Bank, though Facebook is interested in the project as part of its effort to launch wireless communication services in rural regions around the globe. Facebook and friends used software to identify buildings in commercially available satellite images, and then estimated population using census data and a few other surveys and programs. Convolutional neural networks powered a model capable of identifying individual buildings in images from across the world. "There has been a lot of work recently on neural networks that can recognize individual buildings with very high accuracy, but these models are finely tuned on the local characteristics of the region where they are trained," the Connectivity Lab's Tobias Tiecke writes. "We found that these models do not perform well at a global scale with realistic amounts of training data.


Facebook's AI team maps Earth to beam internet access to all

#artificialintelligence

Social networking giant Facebook is using its artificial intelligence (AI) technology and resources to map the entire Earth and launch the world's most detailed population maps that will help it beam cheap internet to remote areas. To begin with, the Facebook AI team crunched 14.6 billion images of maps from across 20 countries, including India, covering 21.6 million sq kms to come up with the first detailed map of human settlement for these countries. "This is an impressive project from our team developing solar-powered planes for beaming down internet connectivity and our AI research team. Many people live in remote communities and accurate data on where people live doesn't always exist," wrote Facebook CEO Mark Zuckerberg in a latest post. The 20 countries mapped were Algeria, Burkina Faso, Cameroon, Egypt, Ethiopia, Ghana, India, Ivory Coast, Kenya, Madagascar, Mexico, Mozambique, Nigeria, South Africa, Sri Lanka, Tanzania, Turkey, Uganda, Ukraine and Uzbekistan.


Hidden Markov Dirichlet Process: Modeling Genetic Recombination in Open Ancestral Space

Sohn, Kyung-ah, Xing, Eric P.

Neural Information Processing Systems

We present a new statistical framework called hidden Markov Dirichlet process (HMDP) to jointly model the genetic recombinations among possibly infinite number of founders and the coalescence-with-mutation events in the resulting genealogies. The HMDP posits that a haplotype of genetic markers is generated by a sequence of recombination events that select an ancestor for each locus from an unbounded set of founders according to a 1st-order Markov transition process. Conjoining this process with a mutation model, our method accommodates both between-lineage recombination and within-lineage sequence variations, and leads to a compact and natural interpretation of the population structure and inheritance process underlying haplotype data. We have developed an efficient sampling algorithm for HMDP based on a two-level nested Pólya urn scheme. On both simulated and real SNP haplotype data, our method performs competitively or significantly better than extant methods in uncovering the recombination hotspots along chromosomal loci; and in addition it also infers the ancestral genetic patterns and offers a highly accurate map of ancestral compositions of modern populations.


Hidden Markov Dirichlet Process: Modeling Genetic Recombination in Open Ancestral Space

Sohn, Kyung-ah, Xing, Eric P.

Neural Information Processing Systems

We present a new statistical framework called hidden Markov Dirichlet process (HMDP) to jointly model the genetic recombinations among possibly infinite number of founders and the coalescence-with-mutation events in the resulting genealogies. The HMDP posits that a haplotype of genetic markers is generated by a sequence of recombination events that select an ancestor for each locus from an unbounded set of founders according to a 1st-order Markov transition process. Conjoining this process with a mutation model, our method accommodates both between-lineage recombination and within-lineage sequence variations, and leads to a compact and natural interpretation of the population structure and inheritance process underlying haplotype data. We have developed an efficient sampling algorithm for HMDP based on a two-level nested Pólya urn scheme. On both simulated and real SNP haplotype data, our method performs competitively or significantly better than extant methods in uncovering the recombination hotspots along chromosomal loci; and in addition it also infers the ancestral genetic patterns and offers a highly accurate map of ancestral compositions of modern populations.


Hidden Markov Dirichlet Process: Modeling Genetic Recombination in Open Ancestral Space

Sohn, Kyung-ah, Xing, Eric P.

Neural Information Processing Systems

We present a new statistical framework called hidden Markov Dirichlet process (HMDP) to jointly model the genetic recombinations among possibly infinite number of founders and the coalescence-with-mutation events in the resulting genealogies. TheHMDP posits that a haplotype of genetic markers is generated by a sequence of recombination events that select an ancestor for each locus from an unbounded set of founders according to a 1st-order Markov transition process. Conjoining this process with a mutation model, our method accommodates both between-lineage recombination and within-lineage sequence variations, and leads to a compact and natural interpretation of the population structure and inheritance process underlying haplotype data. We have developed an efficient sampling algorithm forHMDP based on a two-level nested Pólya urn scheme. On both simulated and real SNP haplotype data, our method performs competitively or significantly better than extant methods in uncovering the recombination hotspots along chromosomal loci;and in addition it also infers the ancestral genetic patterns and offers a highly accurate map of ancestral compositions of modern populations.